Optimizations to the Orthogonal Matching Pursuit Algorithm for Sparse Basis Representations of Photometric Redshift Pdfs
نویسنده
چکیده
منابع مشابه
Beyond Coherence : Recovering Structured Time - Frequency Representations
We consider the problem of recovering a structured sparse representation of a signal in an overcomplete time-frequency dictionary with a particular structure. For infinite dictionaries that are the union of a nice wavelet basis and a Wilson basis, sufficient conditions are given for the Basis Pursuit and (Orthogonal) Matching Pursuit algorithms to recover a structured representation of an admis...
متن کاملOn the Use of A Priori Information for Sparse Signal Representations
This report studies the effect of introducing a priori knowledge to recover sparse representations when overcomplete dictionaries are used. We focus mainly on Greedy algorithms and Basis Pursuit as for our algorithmic basement, while a priori is incorporated by suitably weighting the elements of the dictionary. A unique sufficient condition is provided under which Orthogonal Matching Pursuit, M...
متن کاملInferring sparse representations of continuous signals with continuous orthogonal matching pursuit
Many signals, such as spike trains recorded in multi-channel electrophysiological recordings, may be represented as the sparse sum of translated and scaled copies of waveforms whose timing and amplitudes are of interest. From the aggregate signal, one may seek to estimate the identities, amplitudes, and translations of the waveforms that compose the signal. Here we present a fast method for rec...
متن کاملThe Stability of Regularized Orthogonal Matching Pursuit Algorithm
This paper studies a fundamental problem that arises in sparse representation and compressed sensing community: can greedy algorithms give us a stable recovery from incomplete and contaminated observations ? Using the Regularized Orthogonal Matching Pursuit (ROMP) algorithm, a modified version of Orthogonal Matching Pursuit (OMP) [1], which was recently introduced by D.Needell and R.Vershynin [...
متن کاملLearning Data Representations with Sparse Coding Neural Gas
We consider the problem of learning an unknown (overcomplete) basis from an unknown sparse linear combination. Introducing the “sparse coding neural gas” algorithm, we show how to employ a combination of the original neural gas algorithm and Oja’s rule in order to learn a simple sparse code that represents each training sample by a multiple of one basis vector. We generalise this algorithm usin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016